Construction of Z4-linear Reed-Muller codes

نویسندگان

  • Jaume Pujol
  • Josep Rifà
  • Faina I. Solov'eva
چکیده

New quaternary Plotkin constructions are given and are used to obtain new families of quaternary codes. The parameters of the obtained codes, such as the length, the dimension and the minimum distance are studied. Using these constructions new families of quaternary Reed-Muller codes are built with the peculiarity that after using the Gray map the obtained Z4-linear codes have the same parameters and fundamental properties as the codes in the usual binary linear Reed-Muller family. To make more evident the duality relationships in the constructed families the concept of Kronecker inner product is introduced.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Z4-linearity of Kerdock, Preparata, Goethals, and related codes

Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson , Kerdock, Preparata, Goethals, and Delsarte-Goethals . It is shown here that all these codes can be very simply constructed as binary images under the Gray map of linear codes over Z4, the integers mod 4 (although this requires a slight modificat...

متن کامل

About the Z 4 - linear Reed - Muller ZRM − ( r , m − 1 ) and RM s ( r , m ) codes ?

Several different families of quaternary codes related to Reed-Muller binary linear codes can be found in the literature. Two definitions of such families are denoted as ZRM−(r,m) and {RMs(r,m)}. In the current paper ZRM−(r,m− 1) and {RMs(r,m)} codes are shown to be equal exactly for s = 0 (0 ≤ s ≤ bm−1 2 c). Therefore, for the above-mentioned value of s, Z4-linear Reed-Muller codes with the sa...

متن کامل

On the Apparent Duality of the Kerdock and Preparata Codes

The Kerdock and extended Preparata codes are something of an enigma in coding theory since they are both Hamming-distance invariant and have weight enumerators that are MacWilliams duals just as if they were dual linear codes. In this paper, we explain, by constructing in a natural way a Preparata-like code PL from the Kerdock code K, why the existence of a distance-invariant code with weight d...

متن کامل

On Linear Codes over Z2s

In an earlier paper the authors studied simplex codes of type α and β over Z4 and obtained some known binary linear and nonlinear codes as Gray images of these codes. In this correspondence, we study weight distributions of simplex codes of type α and β over Z2s . The generalized Gray map is then used to construct binary codes. The linear codes meet the Griesmer bound and a few non-linear codes...

متن کامل

A general construction of Reed-Solomon codes based on generalized discrete Fourier transform

In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes  enjoy nice algebraic properties just as the classic one.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2009